On the busy period for the M|G|1 queue with-finite waiting room
نویسندگان
چکیده
منابع مشابه
/G/l QUEUE WITH FINITE WAITING ROOM
The MX/G/1 queue with finite waiting room is studied for both the partially rejected model and the totally rejected model. We start by studying the joint distribution of the number of customers at time t and the remaining service time of customer in service. This gives the asymptotic distribution of the number of customers at an arbitrary moment and immediately after a departure. Also the waiti...
متن کاملOn the Batch Size and the Busy Period in the Finite ’Israeli Queue’
The Israeli Queue is a polling-type system with N groups (queues) and un-limited size batch service, where the next group to be served is the one with the most senior customer. For such a system we derive (i) the mean size of each group, and (ii) the Laplace-Stieltjes Transform and mean of the length of a busy period starting with n ≥ 1 groups. Numerical calculations are presented and the param...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولError Analysis of the Mean Busy Period of a Queue
The error between the actual value of the mean busy periQ..d and the value estimaled by a common queueing tormula (D;:;: SOl (i-V)) is evaluated. tDenning's addre:'l!l: Department of Compu.ter Sciences, Purdue University, W. Lafayette, IN 41907 USA. KoweJk's addre:iS: FClchbcrcich Inrormatik, Univer:ritut Hamburg. RoUlerbllumschau9ce 07/09, 2000 Hamburg 10, West Gcrmuny.
متن کاملMoment Calculating Algorithm for Busy-period of Discrete-time Finite-capacity M/G/1 Type Queue
In this paper, we propose an algorithm to calculate the higher moments of the busy period length of a discretetime M/G/1 type queue with finite buffer. The queueing model has a level-dependent transition probability matrix. Our algorithm is given as a set of recursive formulas which are derived from the relationship among the generating function matrices of the fundamental period. As an example...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle
سال: 1974
ISSN: 0397-9350
DOI: 10.1051/ro/197408v100411